Hard Asymptotic Sets for One-Dimensional Cellular Automata
نویسنده
چکیده
We prove that the (language of the) asymptotic set (and the nonwandering set) of a one-dimensional cellular automaton can be Σ11hard. We do not go into much detail, since the constructions are relatively standard.
منابع مشابه
Construction of μ-Limit Sets of Two-Dimensional Cellular Automata
We prove a characterization of μ-limit sets of two-dimensional cellular automata, extending existing results in the one-dimensional case. This sets describe the typical asymptotic behaviour of the cellular automaton, getting rid of exceptional cases, when starting from the uniform measure.
متن کاملConstruction of mu-Limit Sets of Two-dimensional Cellular Automata
We prove a characterisation of μ-limit sets of two-dimensional cellular automata, extending existing results in the one-dimensional case. This sets describe the typical asymptotic behaviour of the cellular automaton, getting rid of exceptional cases, when starting from the uniform measure. 1998 ACM Subject Classification F.1.1 Models of Computation
متن کاملBI-OBJECTIVE OPTIMIZATION OF RESERVOIR OPERATION BY MULTI-STEP PARALLEL CELLULAR AUTOMATA
Parallel Cellular Automata (PCA) previously has been employed for optimizing bi-objective reservoir operation, where one release is used to meet both objectives. However, if a single release can only be used for one objective, meaning two separate sets of releases are needed, the method is not applicable anymore. In this paper, Multi-Step Parallel Cellular Automata (MSPCA) has been developed fo...
متن کاملA Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem
Job shop scheduling problem (JSSP), as one of the NP-Hard combinatorial optimization problems, has attracted the attention of many researchers during the last four decades. The overall purpose regarding this problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolving Cellular Learning Automata (CLA) in order to enable it to solve the J...
متن کاملImproved Frog Leaping Algorithm Using Cellular Learning Automata
In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1307.4910 شماره
صفحات -
تاریخ انتشار 2013